Dynamic Evolution of Requirement Goal Deployed on Network Environment
نویسندگان
چکیده
منابع مشابه
Language Evolution on a Dynamic Social Network
We study the role of the interaction network in a collaborative learning model known as the classification game. This involves a population of agents collaboratively learning to solve a classification task. We have previously shown that interaction while learning allows the agents to converge upon a simpler solution, which in turns guarantees better generalization. This clearly shows the benefi...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولEvaluating goal models within the goal-oriented requirement language
In this paper, we introduce the application of rigorous analysis procedures to goal models in order to provide several benefits beyond the initial act of modelling. Such analysis can allow modellers to assess the satisfaction of goals, facilitate evaluation of high-level design alternatives, help analysts decide on the high-level requirements and design of the system, test the sanity of a model...
متن کاملInstinct evolution in a goal-seeking neural network
Instincts are a vital part of the behavioral repertoire of organisms. Even humans rely heavily on these inborn mechanisms for survival. Many creatures, for example, build elaborate nests without ever learning through experience. This paper explores this evolutionary legacy in the context of an artificial goal-seeking neural network. An instinct is defined as a simple stimulus-response sequence ...
متن کاملRevenue Management in a Dynamic Network Environment
We investigate dynamic policies for allocating scarce inventory to stochastic demand for multiple fare classes, in a network environment so as to maximize total expected revenues. Typical applications include sequential reservations for an airline network, hotel, or car rental service. We propose and analyze a new algorithm based on approximate dynamic programming, both theoretically and comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advanced Materials Research
سال: 2013
ISSN: 1662-8985
DOI: 10.4028/www.scientific.net/amr.756-759.2197